A parallel algorithm for computing the group inverse via Perron complementation
نویسندگان
چکیده
A parallel algorithm is presented for computing the group inverse of a singular M–matrix of the form A = I − T , where T ∈ Rn×n is irreducible and stochastic. The algorithm is constructed in the spirit of Meyer’s Perron complementation approach to computing the Perron vector of an irreducible nonnegative matrix. The asymptotic number of multiplication operations that is necessary to implement the algorithm is analyzed, which shows that the algorithm saves a significant amount of computation over the direct computation of the group inverse of A.
منابع مشابه
Ela a Parallel Algorithm for Computing the Group Inverse via Perron Complementation∗
A parallel algorithm is presented for computing the group inverse of a singular M–matrix of the form A = I − T , where T ∈ Rn×n is irreducible and stochastic. The algorithm is constructed in the spirit of Meyer’s Perron complementation approach to computing the Perron vector of an irreducible nonnegative matrix. The asymptotic number of multiplication operations that is necessary to implement t...
متن کاملGGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملA Novel Method for VANET Improvement using Cloud Computing
In this paper, we present a novel algorithm for VANET using cloud computing. We accomplish processing, routing and traffic control in a centralized and parallel way by adding one or more server to the network. Each car or node is considered a Client, in such a manner that routing, traffic control, getting information from client and data processing and storing are performed by one or more serve...
متن کاملGreen Energy-aware task scheduling using the DVFS technique in Cloud Computing
Nowdays, energy consumption as a critical issue in distributed computing systems with high performance has become so green computing tries to energy consumption, carbon footprint and CO2 emissions in high performance computing systems (HPCs) such as clusters, Grid and Cloud that a large number of parallel. Reducing energy consumption for high end computing can bring various benefits such as red...
متن کاملOptimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm
Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...
متن کامل